CS 2351-2

Brief

This course will introduce data structures including arrays, stacks, queues, li<x>nked lists, trees, and graphs. We will also cover algorithms including sorting and hashing. Some advanced topics such as balanced trees will be touched if time permits.

Description

Course keywords: data structure, algorithm, programming, graph 1. Course Description This course introduces the basic concept of data representation and manipulation. We will teach how to solve problems efficiently and effectively by using proper and specific data structures, and organizing series of operations called algorithms to manipulate data to solve the problems. For instance, you will be able to understand how to use link list and hash function to create block chains. 2. Prerequisite Course C/C++ Programming Language 3. Text Books Fundamentals of Data Structures in C++, E. Horowitz, S. Sahni, and D. Mehta, 2nd ed., 2006. 4. References Introduction to Algorithms, 3rd ed., by Cormen et al. C++ reference (http://www.cplusplus.com/reference/) 5. Teaching Method: Online Lectures + In class discussions 6. Course Outline Basic Concepts Arrays Stacks and queues linked lists Trees Graphs Sorting Hashing Selected related topics 7. Evaluation midterm 1: 33% midterm 2: 33% Final: 34% 8. Weblink: eeClass (https://eeclass.nthu.edu.tw/)

Timetable

Remarks

非資工本系生請修習113下特別為資工輔系,雙主修,專長同學開設之同名課程,R34上機教室:資電326,328

Restrictions

資工系大學部2年級,電資院學士班大學部2年級優先，第3次選課起開放全校修習

Compulsory

Elective

Cross Discipline

First Specialization

Second Specialization